A computational logic test for complex system networks
نویسندگان
چکیده
منابع مشابه
Universal delay test sets for logic networks
| It has been shown earlier that, if we restrict to unate gate network (UGN) realizations, there exist universal test sets for boolean functions. Such a test set only depends on the function f , and checks any UGN realization of f for all multiple stuck-at faults and all robustly testable stuck-open faults. In this paper we prove that these universal test sets are much more powerful than implie...
متن کاملA Novel Fuzzy Logic Base Scheduling Mechanism for Service Differentiation in IP Networks
Quality of Service (QoS) refers to a set of rules or techniques that help the network administrators use the available network resources optimally to manage the effects of congestion and to treat the applications according to their needs. The differentiated services architecture (DiffServ) allows providing quality of service to users. The major DiffServ premise is that individual flows with sim...
متن کاملA Description Logic System for Learning in Complex Domains
This paper introduces YAYA 1 , a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it introduces a limited use of variables. Language limited expressiveness in combination with a special inference mechanism allow YAYA to achieve its main goal: to acquire a model (TBox) from a set of examples that all...
متن کاملA computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملTime-varying system theory for computational networks
Many computational schemes in Linear Algebra can be studied from the point of view of TimeVarying Linear Systems theory. This approach not only puts a variety of results in a unified framework, but also generates new and unexpected results such as strong approximations of operators or matrices by computational networks of low complexity, and the embedding of contractive operations in orthogonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: <i>WORD</i>
سال: 1989
ISSN: 0043-7956,2373-5112
DOI: 10.1080/00437956.1989.11435809